Tutorial summary Machine learning in IR recent successes and new opportunities.

Catching the drift learning broad matches from clickthrough data.

Information retrieval and advertising.
Advertising is a multi-billion dollar industry that has become a significant component of the Web browsing experience. Online advertising systems incorporate many information retrieval techniques by combining content analysis, user interaction models, and commercial constraints. Advances in online advertising have come from integrating several core research areas: information retrieval, data mining, machine learning, and user modeling. The workshop will serve as an open forum for discussion of new ideas and current research related to information retrieval topics relevant to online advertising. The outcome will be a set of full and short papers covering a variety of topics. The short paper format will allow researchers new to the area to actively participate and explore novel themes. It will also enable researchers without access to extensive empirical data to propose ideas and experiments. We also expect the workshop to help develop a community of researchers interested in this area, and yield future collaboration and exchanges. Despite its commercial significance, advertising is a rather young field of research. This workshop will help the emerging research community better organize and develop a
Enhancing web search by promoting multiple search engine use.

Enhancing web search by promoting multiple search engine use.

Talking the talk vs. walking the walk salience of information needs in querying vs. browsing.
Traditional information retrieval models assume that users express their information needs via text queries (i.e., their “talk”). In this poster, we consider Web browsing behavior outside of interactions with retrieval systems (i.e., users ’ “walk”) as an alternative source of signal describing users ’ information needs, and compare it to the query-expressed information needs on a large dataset. Our findings demonstrate that information needs expressed in different behavior modalities are largely non-overlapping, and that past behavior in each modality is the most accurate predictor of future behavior in that modality. Results also show that browsing data provides a stronger source of signal than search queries due to its greater volume, which explains previous work that has found implicit behavioral data to be a valuable source of information for user modeling and personalization.
Mining the search trails of surfing crowds identifying relevant websites from user activity.

Leveraging popular destinations to enhance Web search interaction.
This article presents a novel Web search interaction feature that for a given query provides links to Web sites frequently visited by other users with similar information needs. These popular destinations complement traditional search results, allowing direct navigation to authoritative resources for the query topic. Destinations are identified using the history of search and browsing behavior of many users over an extended time period, and their collective behavior provides a basis for computing source authority. They are drawn from the end of users ’ post-query browse trails, where users may cease searching once they find relevant information. We describe a user study that compared the suggestion of destinations with the previously proposed suggestion of related queries, as well as with traditional, unaided Web search. Results show that search enhanced by query suggestions outperforms other systems, in terms of subject perceptions and search effectiveness, for fact-finding search tasks. However, search enhanced by destination suggestions performs best for exploratory tasks, with best performance obtained from mining past user behavior at query-level granularity. We discuss the implications of these and other findings from our study for the design of search systems that utilize user behavior, in particular user browse trails and popular destinations.
Studying the use of popular destinations to enhance web search interaction.
We present a novel Web search interaction feature which, for a given query, provides links to websites frequently visited by other users with similar information needs. These popular destinations complement traditional search results, allowing direct navigation to authoritative resources for the query topic. Destinations are identified using the history of search and browsing behavior of many users over an extended time period, whose collective behavior provides a basis for computing source authority. We describe a user study which compared the suggestion of destinations with the previously proposed suggestion of related queries, as well as with traditional, unaided Web search. Results show that search enhanced by destination suggestions outperforms other systems for exploratory tasks, with best performance obtained from mining past user behavior at query-level granularity.
Adaptive Blocking Learning to Scale Up Record Linkage.
Many data mining tasks require computing similarity between pairs of objects. Pairwise similarity computations are particularly important in record linkage systems, as well as in clustering and schema mapping algorithms. Because the number of object pairs grows quadratically with the size of the dataset, computing similarity between all pairs is impractical and becomes prohibitive for large datasets and complex similarity functions. Blocking methods alleviate this problem by efficiently selecting approximately similar object pairs for subsequent distance computations, leaving out the remaining pairs as dissimilar. Previously proposed blocking methods require manually constructing an indexbased similarity function or selecting a set of predicates, followed by hand-tuning of parameters. In this paper, we introduce an adaptive framework for automatically learning blocking functions that are efficient and accurate. We describe two predicate-based formulations of learnable blocking functions and provide learning algorithms for training them. The effectiveness of the proposed techniques is demonstrated on real and simulated datasets, on which they prove to be more accurate than non-adaptive blocking methods. 1
Adaptive Product Normalization Using Online Learning for Record Linkage in Comparison Shopping.
The problem of record linkage focuses on determining whether two object descriptions refer to the same underlying entity. Addressing this problem effectively has many practical applications, e.g., elimination of duplicate records in databases and citation matching for scholarly articles. In this paper, we consider a new domain where the record linkage problem is manifested: Internet comparison shopping. We address the resulting linkage setting that requires learning a similarity function between record pairs from streaming data. The learned similarity function is subsequently used in clustering to determine which records are co-referent and should be linked. We present an online machine learning method for addressing this problem, where a composite similarity function based on a linear combination of basis functions is learned incrementally. We illustrate the efficacy of this approach on several real-world datasets from an Internet comparison shopping site, and show that our method is able to effectively learn various distance functions for product data with differing characteristics. We also provide experimental results that show the importance of considering multiple performance measures in record linkage evaluation. 1
Learnable Similarity Functions and their Applications to Clustering and Record Linkage.
rship (Xing et al. 2003), and relative comparisons (Schultz &amp; Joachims 2004). These approaches have shown improvements over traditional similarity functions for different data types such as vectors in Euclidean space, strings, and database records composed of multiple text fields. While these initial results are encouraging, there still remains a large number of similarity functions that are currently unable to adapt to a particular domain. In our research, we attempt to bridge this gap by developing both new learnable similarity functions and methods for their application to particular problems in machine learning and data mining.  In preliminary work, we proposed two learnable similarity functions for strings that adapt distance computations given training pairs of equivalent and non-equivalent strings (Bilenko &amp; Mooney 2003a). The first function is based on a probabilistic model of edit distance with affine gaps (Gus- Copyright c  #  2004, American Association for Artificial Intelli
Integrating constraints and metric learning in semi%2Dsupervised clustering.
Semi-supervised clustering employs a small  amount of labeled data to aid unsupervised  learning. Previous work in the area has utilized  supervised data in one of two approaches:  1) constraint-based methods that guide the clustering  algorithm towards a better grouping of the  data, and 2) distance-function learning methods  that adapt the underlying similarity metric used  by the clustering algorithm. This paper provides  new methods for the two approaches as well as  presents a new semi-supervised clustering algorithm  that integrates both of these techniques in  a uniform, principled framework. Experimental  results demonstrate that the unified approach  produces better clusters than both individual approaches  as well as previously proposed semisupervised  clustering algorithms.
A probabilistic framework for semi%2Dsupervised clustering.
Unsupervised clustering can be significantly improved using supervision in the form of pairwise constraints, i.e., pairs of instances labeled as belonging to same or different clusters. In recent years, a number of algorithms have been proposed for enhancing clustering quality by employing such supervision. Such methods use the constraints to either modify the objective function, or to learn the distance measure. We propose a probabilistic model for semisupervised clustering based on Hidden Markov Random Fields (HMRFs) that provides a principled framework for incorporating supervision into prototype-based clustering. The model generalizes a previous approach that combines constraints and Euclidean distance learning, and allows the use of a broad range of clustering distortion measures, including Bregman divergences (e.g., Euclidean distance and I-divergence) and directional similarity measures (e.g., cosine similarity). We present an algorithm that performs partitional semi-supervised clustering of data by minimizing an objective function derived from the posterior energy of the HMRF model. Experimental results on several text data sets demonstrate the advantages of the proposed framework. 1.
Employing Trainable String Similarity Metrics for Information Integration.
The problem of identifying approximately duplicate  objects in databases is an essential step for  the information integration process. Most existing  approaches have relied on generic or manually  tuned distance metrics for estimating the similarity  of potential duplicates. In this paper, we  present a framework for improving duplicate detection  using trainable measures of textual similarity.
Employing Trainable String Similarity Metrics for Information Integration.
The problem of identifying approximately duplicate  objects in databases is an essential step for  the information integration process. Most existing  approaches have relied on generic or manually  tuned distance metrics for estimating the similarity  of potential duplicates. In this paper, we  present a framework for improving duplicate detection  using trainable measures of textual similarity.


Adaptive Name Matching in Information Integration.
approximately duplicate database records that refer to the same entity is essential for information integration. The authors compare and describe methods for combining and learning textual similarity measures for name matching. Copyright © 2003 IEEE. Reprinted from IEEE Intelligent Systems,vol. 18. no. 5. This material is posted here with permission of the IEEE. Such permission of the IEEE does not in any way imply IEEE endorsement of any mentioned products or services. Internal or personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution must be obtained from the IEEE by sending a blank email message to pubs-permissions@ieee.org.
